package com.justnow.offer;

/**
 * @author justnow
 * Created on 2020-09-19
 * Description
 */
public class Solution14_1_TIME02 {
    public int cuttingRope(int n) {
        int[] dp = new int[n + 1];
        dp[2] = 1;
        for (int i = 3; i < n + 1; i++) {
            for (int j = 0; j < i; j++) {
                dp[i] = Math.max(dp[i], Math.max((i - j) * j, j *dp[i - j]));
            }
        }
        return dp[n];
    }
}
